Probabilistic termination versus fair termination
نویسندگان
چکیده
منابع مشابه
Probabilistic Termination Versus Fair Termination
In this paper we show that probabilistic termination of concurrent program is in many cases much simpler than the "f~" one. For a wide class of definitions of probabilistic termination we may express termination by rrf arithmetic formula, whereas the "fair" termination can be expressed only by rrf secqnd order arithmetic formula. Proof of "fair" termination usually needs induction on recursive ...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملTree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible, equivalent substructures are stored in the same place. The new representation is based on a first approximation of the sets which has this uniqueness property. This approximation is then refined using powerful repre...
متن کاملProbabilistic Termination in B
The B Method [1] does not currently handle probability. We add it in a limited form, concentrating on “almost-certain” properties which hold with probability one; and we address briefly the implied modifications to the programs that support B. The Generalised Substitution Language is extended with a binary operator ⊕ representing “abstract probabilistic choice”, so that the substitution prog1 ⊕...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90158-8